Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem

In project scheduling under processing times uncertainty, the Anchor-Robust Project Scheduling Problem is to find a baseline schedule of bounded makespan and max-weight subset jobs whose starting are guaranteed. The problem was proven NP-hard even for budgeted uncertainty. present work we design mixed-integer programming (MIP) formulations that valid variety uncertainty sets encompassing A new dominance among solutions proposed, resulting into an MIP formulation. We further study combinatorial structure problem. Non-trivial polynomial cases exhibited, where dominance-based formulation yields polyhedral characterization integer solutions. more general cases, shown be tighter than all previously known formulations. numerical experiments investigate how performs on instances around both elaborate involving several budgets.